Exponential Decay Pruning for Bottom-Up Beam-Search Parsing

نویسندگان

  • Nathan Bodenstab
  • Aaron Dunlop
  • Brian Roark
  • Keith Hall
چکیده

We describe and motivate bottom-up beamsearch parsing, a probabilistic constituent parsing architecture that combines the advantages of best-first agenda parsing and bottom-up chart parsing into a unified framework. We also present Exponential Decay Pruning (EDP), a novel beam-width pruning technique that is simple and effective, increasing parsing speed up to 43% with no loss in accuracy. Using these techniques together, our system requires no knowledge of the underlying grammar, has a small memory footprint, and parses at stateof-the-art speed and accuracy levels. We demonstrate the flexibility of our approach by parsing with five different grammars and validate its effectiveness by comparing it to both the best-first and coarse-to-fine parsing algo-

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Online Learning for Inexact Hypergraph Search

Online learning algorithms like the perceptron are widely used for structured prediction tasks. For sequential search problems, like left-to-right tagging and parsing, beam search has been successfully combined with perceptron variants that accommodate search errors (Collins and Roark, 2004; Huang et al., 2012). However, perceptron training with inexact search is less studied for bottom-up pars...

متن کامل

An Effective Framework for Chinese Syntactic Parsing

This paper presents an effective framework for Chinese syntactic parsing, which includes two parts. The first one is a parsing framework, which is based on an improved bottom-up chart parsing algorithm, and integrates the idea of the beam search strategy of N best algorithm and heuristic function of A* algorithm for pruning, then get multiple parsing trees. The second is a novel evaluation mode...

متن کامل

Frontier Pruning for Shift-Reduce CCG Parsing

We apply the graph-structured stack (GSS) to shift-reduce parsing in a Combinatory Categorial Grammar (CCG) parser. This allows the shift-reduce parser to explore all possible parses in polynomial time without resorting to heuristics, such as beam search. The GSSbased shift-reduce parser is 34% slower than CKY in the finely-tuned C&C parser. We perform frontier pruning on the GSS, increasing th...

متن کامل

Discontinuous Incremental Shift-reduce Parsing

We present an extension to incremental shift-reduce parsing that handles discontinuous constituents, using a linear classifier and beam search. We achieve very high parsing speeds (up to 640 sent./sec.) and accurate results (up to 79.52 F1 on TiGer).

متن کامل

TFLEX: Speeding Up Deep Parsing with Strategic Pruning

This paper presents a method for speeding up a deep parser through backbone extraction and pruning based on CFG ambiguity packing.1 The TRIPS grammar is a wide-coverage grammar for deep natural language understanding in dialogue, utilized in 6 different application domains, and with high coverage and sentence-level accuracy on human-human task-oriented dialogue corpora (Dzikovska, 2004). The TR...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010